Dynamically adjusting a number of memory copy and memory mapping windows to optimize i/o performance

ABSTRACT

A method to dynamically optimize utilization of data transfer techniques includes processing multiple I/O requests using one of several data transfer techniques depending on which data transfer technique is more efficient. The data transfer techniques include: a memory copy data transfer technique that copies cache segments associated with an I/O request from a cache memory to a permanently mapped memory; and a memory mapping data transfer technique that temporarily maps cache segments associated with an I/O request. In order to process the I/O requests, the method utilizes a first number of “copy” windows associated with the memory copy data transfer technique, and a second number of “mapping” windows associated with the memory mapping data transfer technique. The method dynamically adjusts one or more of the first number and the second number to optimize the processing of the I/O requests. A corresponding system and computer program product are also disclosed.

BACKGROUND Field of the Invention

This invention relates to systems and methods for dynamically switchingbetween memory copy and memory mapping techniques to optimize I/Operformance in storage systems.

Background of the Invention

A Peripheral Component Interconnect (PCI) host bridge may enablecommunication between a processor and an input/output (I/O) subsystemwithin a data processing system. The PCI host bridge provides databuffering capabilities to enable read and write data to be transferredbetween the processor and the I/O subsystem. The I/O subsystem may be agroup of PCI devices connected to a PCI bus. When a PCI device on thePCI bus originates a read or write command to a system memory via adirect memory access (DMA), the PCI host bridge translates a PCI addressof the DMA to a system memory address of the system memory.

Each PCI device on the PCI bus may be associated with a correspondingtranslation control entry (TCE) table resident within the system memory.The TCE table may be utilized to perform TCE translations from PCIaddresses to system memory addresses. In response to a DMA read or writeoperation, a corresponding TCE table is read by the PCI host bridge toprovide a TCE translation.

In storage systems such as the IBM DS8000™ enterprise storage system,each I/O that is processed by the storage system requires mapping cachememory of the storage system one or more times. For example, a read hitto the cache memory requires creation of a TCE mapping so that a hostadapter can read the cache memory via a DMA. This TCE mapping is thenunmapped after the DMA is complete. In the case of a read miss, two TCEmappings are required: one mapping between the cache memory and a deviceadapter in order to retrieve the read data from storage drives, and asecond mapping between the cache memory and a host adapter in order toreturn the read data to a host system. After the DMAs are complete, theTCE mappings may be unmapped.

In view of the foregoing, what are needed are alternative data transfertechniques for transferring data within storage systems such as the IBMDS8000™ enterprise storage system. Further needed are systems andmethods to dynamically switch between several data transfer techniquesto optimize I/O performance in storage systems such as the IBM DS8000™enterprise storage system.

SUMMARY

The invention has been developed in response to the present state of theart and, in particular, in response to the problems and needs in the artthat have not yet been fully solved by currently available systems andmethods. Accordingly, embodiments of the invention have been developedto dynamically optimize utilization of data transfer techniques. Thefeatures and advantages of the invention will become more fully apparentfrom the following description and appended claims, or may be learned bypractice of the invention as set forth hereinafter.

Consistent with the foregoing, a method is disclosed to dynamicallyoptimize utilization of data transfer techniques. The method processeseach of multiple I/O requests using one of several data transfertechniques depending on which data transfer technique is more efficient.The data transfer techniques include: a memory copy data transfertechnique that copies cache segments associated with an I/O request froma cache memory to a permanently mapped memory that is permanently mappedto a bus address window; and a memory mapping data transfer techniquethat temporarily maps cache segments associated with an I/O request fromthe cache memory to the bus address window. In order to process the I/Orequests, the method utilizes a first number of “copy” windowsassociated with the memory copy data transfer technique, and a secondnumber of “mapping” windows associated with the memory mapping datatransfer technique. The method dynamically adjusts one or more of thefirst number and the second number to optimize the processing of the I/Orequests.

A corresponding system and computer program product are also disclosedand claimed herein.

BRIEF DESCRIPTION OF THE DRAWINGS

In order that the advantages of the invention will be readilyunderstood, a more particular description of the invention brieflydescribed above will be rendered by reference to specific embodimentsillustrated in the appended drawings. Understanding that these drawingsdepict only typical embodiments of the invention and are not thereforeto be considered limiting of its scope, the invention will be describedand explained with additional specificity and detail through use of theaccompanying drawings, in which:

FIG. 1 is a high-level block diagram showing one example of a networkenvironment in which systems and methods in accordance with theinvention may be implemented;

FIG. 2 is a high-level block diagram showing one embodiment of a storagesystem for use in the network environment of FIG. 1;

FIG. 3 is a high-level block diagram showing one example of a memorymapping data transfer technique;

FIG. 4 is a high-level block diagram showing one example of a memorycopy data transfer technique;

FIG. 5 is a flow diagram showing one embodiment of a method fordetermining which data transfer technique to use for a particular I/Orequest;

FIG. 6 is a high-level block diagram showing “mapping” windows allocatedfor use with a memory mapping data transfer technique and “copy” windowsallocated for use with a memory copy data transfer technique;

FIG. 7 is a high-level block diagram showing dynamically adjusting anumber of “mapping” windows and a number of “copy” windows to promoteefficiency when processing I/O requests;

FIG. 8 is a flow diagram showing one embodiment of a method foroptimizing a number of “mapping” windows used in association with amemory mapping data transfer technique, and a number of “copy” windowsused in association with a memory copy data transfer technique;

FIG. 9 is a flow diagram showing another embodiment of a method foroptimizing a number of “mapping” windows used in association with amemory mapping data transfer technique, and a number of “copy” windowsused in association with a memory copy data transfer technique; and

FIG. 10 is a flow diagram showing one embodiment of a method fordetermining whether to utilize a memory mapping data transfer techniqueor a memory copy data transfer technique to process an I/O request.

DETAILED DESCRIPTION

It will be readily understood that the components of the presentinvention, as generally described and illustrated in the Figures herein,could be arranged and designed in a wide variety of differentconfigurations. Thus, the following more detailed description of theembodiments of the invention, as represented in the Figures, is notintended to limit the scope of the invention, as claimed, but is merelyrepresentative of certain examples of presently contemplated embodimentsin accordance with the invention. The presently described embodimentswill be best understood by reference to the drawings, wherein like partsare designated by like numerals throughout.

The present invention may be embodied as a system, method, and/orcomputer program product. The computer program product may include acomputer readable storage medium (or media) having computer readableprogram instructions thereon for causing a processor to carry outaspects of the present invention.

The computer readable storage medium may be a tangible device that canretain and store instructions for use by an instruction executiondevice. The computer readable storage medium may be, for example, but isnot limited to, an electronic storage system, a magnetic storage system,an optical storage system, an electromagnetic storage system, asemiconductor storage system, or any suitable combination of theforegoing. A non-exhaustive list of more specific examples of thecomputer readable storage medium includes the following: a portablecomputer diskette, a hard disk, a random access memory (RAM), aread-only memory (ROM), an erasable programmable read-only memory (EPROMor Flash memory), a static random access memory (SRAM), a portablecompact disc read-only memory (CD-ROM), a digital versatile disk (DVD),a memory stick, a floppy disk, a mechanically encoded device such aspunch-cards or raised structures in a groove having instructionsrecorded thereon, and any suitable combination of the foregoing. Acomputer readable storage medium, as used herein, is not to be construedas being transitory signals per se, such as radio waves or other freelypropagating electromagnetic waves, electromagnetic waves propagatingthrough a waveguide or other transmission media (e.g., light pulsespassing through a fiber-optic cable), or electrical signals transmittedthrough a wire.

Computer readable program instructions described herein can bedownloaded to respective computing/processing devices from a computerreadable storage medium or to an external computer or external storagesystem via a network, for example, the Internet, a local area network, awide area network and/or a wireless network. The network may comprisecopper transmission cables, optical transmission fibers, wirelesstransmission, routers, firewalls, switches, gateway computers and/oredge servers. A network adapter card or network interface in eachcomputing/processing device receives computer readable programinstructions from the network and forwards the computer readable programinstructions for storage in a computer readable storage medium withinthe respective computing/processing device.

Computer readable program instructions for carrying out operations ofthe present invention may be assembler instructions,instruction-set-architecture (ISA) instructions, machine instructions,machine dependent instructions, microcode, firmware instructions,state-setting data, or either source code or object code written in anycombination of one or more programming languages, including an objectoriented programming language such as Smalltalk, C++ or the like, andconventional procedural programming languages, such as the “C”programming language or similar programming languages.

The computer readable program instructions may execute entirely on auser's computer, partly on a user's computer, as a stand-alone softwarepackage, partly on a user's computer and partly on a remote computer, orentirely on a remote computer or server. In the latter scenario, aremote computer may be connected to a user's computer through any typeof network, including a local area network (LAN) or a wide area network(WAN), or the connection may be made to an external computer (forexample, through the Internet using an Internet Service Provider). Insome embodiments, electronic circuitry including, for example,programmable logic circuitry, field-programmable gate arrays (FPGA), orprogrammable logic arrays (PLA) may execute the computer readableprogram instructions by utilizing state information of the computerreadable program instructions to personalize the electronic circuitry,in order to perform aspects of the present invention.

Aspects of the present invention may be described herein with referenceto flowchart illustrations and/or block diagrams of methods, apparatus(systems), and computer program products according to embodiments of theinvention. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, may be implemented bycomputer readable program instructions.

These computer readable program instructions may be provided to aprocessor of a general purpose computer, special purpose computer, orother programmable data processing apparatus to produce a machine, suchthat the instructions, which execute via the processor of the computeror other programmable data processing apparatus, create means forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks. These computer readable program instructionsmay also be stored in a computer readable storage medium that can directa computer, a programmable data processing apparatus, and/or otherdevices to function in a particular manner, such that the computerreadable storage medium having instructions stored therein comprises anarticle of manufacture including instructions which implement aspects ofthe function/act specified in the flowchart and/or block diagram blockor blocks.

The computer readable program instructions may also be loaded onto acomputer, other programmable data processing apparatus, or other deviceto cause a series of operational steps to be performed on the computer,other programmable apparatus, or other device to produce a computerimplemented process, such that the instructions which execute on thecomputer, other programmable apparatus, or other device implement thefunctions/acts specified in the flowchart and/or block diagram block orblocks.

Referring to FIG. 1, one example of a network environment 100 isillustrated. The network environment 100 is presented to show oneexample of an environment where systems and methods in accordance withthe invention may be implemented. The network environment 100 ispresented by way of example and not limitation. Indeed, the systems andmethods disclosed herein may be applicable to a wide variety ofdifferent network environments in addition to the network environment100 shown.

As shown, the network environment 100 includes one or more computers102, 106 interconnected by a network 104. The network 104 may include,for example, a local-area-network (LAN) 104, a wide-area-network (WAN)104, the Internet 104, an intranet 104, or the like. In certainembodiments, the computers 102, 106 may include both client computers102 and server computers 106 (also referred to herein as “hosts” 106 or“host systems” 106). In general, the client computers 102 initiatecommunication sessions, whereas the server computers 106 wait for andrespond to requests from the client computers 102. In certainembodiments, the computers 102 and/or servers 106 may connect to one ormore internal or external direct-attached storage systems 112 (e.g.,arrays of hard-storage drives, solid-state drives, tape drives, etc.).These computers 102, 106 and direct-attached storage systems 112 maycommunicate using protocols such as ATA, SATA, SCSI, SAS, Fibre Channel,or the like.

The network environment 100 may, in certain embodiments, include astorage network 108 behind the servers 106, such as astorage-area-network (SAN) 108 or a LAN 108 (e.g., when usingnetwork-attached storage). This network 108 may connect the servers 106to one or more storage systems 110, such as arrays 110 a of hard-diskdrives or solid-state drives, tape libraries 110 b, individual hard-diskdrives 110 c or solid-state drives 110 c, tape drives 110 d, CD-ROMlibraries, or the like. To access a storage system 110, a host system106 may communicate over physical connections from one or more ports onthe host 106 to one or more ports on the storage system 110. Aconnection may be through a switch, fabric, direct connection, or thelike. In certain embodiments, the servers 106 and storage systems 110may communicate using a networking standard such as Fibre Channel (FC)or iSCSI.

Referring to FIG. 2, one example of a storage system 110 a containing anarray of hard-disk drives 204 and/or solid-state drives 204 isillustrated. The internal components of the storage system 110 a areshown since systems and methods in accordance with the invention may beimplemented within such a storage system 110 a. As shown, the storagesystem 110 a includes a storage controller 200, one or more switches202, and one or more storage drives 204, such as hard-disk drives 204and/or solid-state drives 204 (e.g., flash-memory-based drives 204). Thestorage controller 200 may enable one or more host systems 106 (e.g.,open system and/or mainframe servers 106 running operating systems suchz/OS, zVM, or the like) to access data in the one or more storage drives204.

In selected embodiments, the storage controller 200 includes one or moreservers 206 a, 206 b. The storage controller 200 may also include hostadapters 208 and device adapters 210 to connect the storage controller200 to host systems 106 and storage drives 204, respectively. Multipleservers 206 a, 206 b may provide redundancy to ensure that data isalways available to connected host systems 106. Thus, when one server206 a fails, the other server 206 b may pick up the I/O load of thefailed server 206 a to ensure that I/O is able to continue between thehost systems 106 and the storage drives 204. This process may bereferred to as a “failover.”

In selected embodiments, each server 206 includes one or more processors212 and memory 214. The memory 214 may include volatile memory (e.g.,RAM) as well as non-volatile memory (e.g., ROM, EPROM, EEPROM, harddisks, flash memory, etc.). The volatile and non-volatile memory may, incertain embodiments, store software modules that run on the processor(s)212 and are used to access data in the storage drives 204. Thesesoftware modules may manage all read and write requests to logicalvolumes in the storage drives 204.

In certain embodiments, the memory 214 includes a cache 216, such as aDRAM cache 216. Whenever a host 106 (e.g., an open system or mainframeserver) performs a read operation for data that is not resident in cache216, the server 206 that performs the read may fetch data from thestorage drives 204 and save it in its cache 216 in the event it isneeded again. If the data is requested again by a host system 106, theserver 206 may fetch the data from the cache 216 instead of fetching itfrom the storage drives 204, saving both time and resources. Similarly,when a host system 106 performs a write, the server 206 that receivesthe write request may store the modified data in its cache 216, anddestage the modified data to the storage drives 204 at a later time.

One example of a storage system 110 a having an architecture similar tothat illustrated in FIG. 2 is the IBM DS8000™ enterprise storage system.The DS8000™ is a high-performance, high-capacity storage controllerproviding disk and solid-state storage that is designed to supportcontinuous operations. Nevertheless, the techniques disclosed herein arenot limited to the IBM DS8000™ enterprise storage system 110 a, but maybe implemented in any comparable or analogous storage system 110,regardless of the manufacturer, product name, or components or componentnames associated with the system 110. Any storage system that couldbenefit from one or more embodiments of the invention is deemed to fallwithin the scope of the invention. Thus, the IBM DS8000™ is presentedonly by way of example and not limitation.

Referring to FIG. 3, in general, a Peripheral Component Interconnect(PCI) host bridge may enable communication between a processor and aninput/output (I/O) subsystem within a data processing system. The PCIhost bridge may provide data buffering capabilities to enable read andwrite data to be transferred between the processor and the I/Osubsystem. The I/O subsystem may be a group of PCI devices (hostadapters and/or device adapters) connected to a PCI bus. When a PCIdevice on the PCI bus originates a read or write command to a systemmemory via a direct memory access (DMA), the PCI host bridge maytranslate a PCI address of the DMA to a system memory address of thesystem memory.

Each PCI device on a PCI bus may be associated with a correspondingtranslation control entry (TCE) mapping 302 resident within the systemmemory 214. The TCE mappings 302 may be utilized to perform TCEtranslations from PCI addresses to system memory addresses. In responseto a DMA read or write operation, a corresponding TCE mapping is read bythe PCI host bridge to provide a TCE translation.

In storage systems such as the IBM DS8000™ enterprise storage system,each I/O that is processed by the storage system 110 requires mappingcache memory 216 of the storage system 110 one or more times. Forexample, a read hit to the cache memory 216 requires creation of a TCEmapping 302 so that a host adapter 208 can read the cache memory 216 viaa DMA. This TCE mapping 302 is then unmapped after the DMA is complete.In the case of a read miss, two TCE mappings are required: one mapping302 between the cache memory 216 and a device adapter 210 in order toretrieve the read data from storage drives 204, and a second mapping 302between the cache memory 216 and a host adapter 208 in order to returnthe read data to a host system 106. After the DMAs are complete, the TCEmappings 302 may be unmapped.

TCE mapping and unmapping may be costly in terms of time, especiallywith high I/O rates. One way to circumvent the need for TCE mappings 302is to keep certain portions of cache memory 216 permanently mapped(i.e., use dedicated permanently mapped memory). When an I/O arrives,requested data may be copied from the cache memory 216 to thispermanently mapped memory 400. The DMA may then occur from thispermanently mapped memory 400 without needing to perform a TCEmapping/unmapping. This technique eliminates the cost (e.g., timeneeded) to perform the TCE mapping/unmapping, but introduces the cost(e.g., time needed) to copy data from one memory location to another.This cost may depend on where the two memory locations are relative toone another. Sometimes the cost may be less to perform a TCEmapping/unmapping and other times the cost may be less to copy data topermanently mapped memory 400.

In view of the foregoing, systems and methods are needed to dynamicallyswitch between memory copy and memory mapping data transfer technique tooptimize I/O performance in storage systems such as the IBM DS8000™enterprise storage system. Ideally, depending on the I/O operationinvolved, such systems and methods will utilize the data transfertechnique (i.e., memory copy or memory mapping) that is most efficient.

FIG. 3 is a high-level block diagram showing one example of a memorymapping data transfer technique, such as TCE mapping. As shown, a cache216 may include one or more cache segments 300, such as four kilobytecache segments 300. In certain embodiments, a data element such as a“track” may be made up of multiple cache segments 300, such as seventeencache segments 300. Thus, where a track is made up of seventeen cachesegments 300 of four kilobytes each, the track may contain sixty-eightkilobytes of data. In many cases, the cache segments 300 associated witha track may not be contiguous in the cache 216. That is, the cachesegments 300 of the track may be sporadically or randomly located indifferent locations in the cache 216. Thus, to read or write a track(i.e., a contiguous sequence of cache segments 300) in the cache 216,the track may need to be mapped to corresponding cache segments 300. Incertain embodiments, a mapping 302 (e.g., a TCE mapping 302) may mapcache segments 300 associated with the track to a bus address window 304so that a host adapter 208 and/or device adapter 210 may transfer thetrack to/from the cache 216 via DMA. In certain embodiments, the mapping302 may order the cache segments 300 in the order they are arranged inthe track, as shown in FIG. 3.

FIG. 4 is a high-level block diagram showing an example of a memory copydata transfer technique. As shown, instead of mapping cache segments 300to a bus address window 304, a memory copy data transfer technique mayfirst copy cache segments 300 associated with a data element (e.g.,track) to a permanently mapped memory 400. The permanently mapped memory400 may reside in the same memory 214 (e.g., memory chip) as the cache216 or in a different memory 214 (e.g., memory chip). Thus, copying thecache segments 300 from the cache 216 to the permanently mapped memory400 may have some cost, the magnitude of which may vary in accordancewith the locations of the cache 216 and the permanently mapped memory400 and the time needed to copy data therebetween. In certainembodiments, the copied cache segments 300 may be ordered in thepermanently mapped memory 400 in the same way they exist in the track,thereby providing a contiguous ordered group of cache segments 300 thatcan be transferred via DMA by a host adapter 208 and/or device adapter210.

Referring to FIG. 5, a flow diagram showing one embodiment of a method500 for determining which data transfer technique to use with respect toa particular I/O request is illustrated. This method 500 may beperformed each time an I/O request is received by the storage system110. As shown, the method 500 initially receives 502 an I/O request. Themethod 500 then computes 504 a cost associated with executing the I/Orequest using a memory mapping data transfer technique, such as thememory mapping data transfer technique described in FIG. 3. In certainembodiments, the cost may be calculated 504 by analyzing past statisticsto determine how long it typically takes to map and unmap a particulartrack of data.

The method 500 then computes 506 the cost of executing the I/O requestusing a memory copy data transfer technique, such as the memory copydata transfer technique described in association with FIG. 4. In certainembodiments, the cost associated with using the memory copy datatransfer technique is calculated by determining a number of cachesegments 300 to copy to the permanently mapped memory 400. In certainembodiments, the memory copy data transfer technique may be used to copyless than a full track of data whereas the memory mapping data transfertechnique may need to map a full track of cache segments 300. Thus, thememory copy data transfer technique may be more efficient with smallertransfers (e.g., less than a full track of data) than the memory mappingdata transfer technique. The cost associated with the memory copy datatransfer technique may also depend on the relative locations of thecache 216 and the permanently mapped memory 400. If the cache 216 andpermanently mapped memory 400 are located on the same memory chip, forexample, the cost may be less since the time to copy the data may beshorter. On the other hand, if the cache 216 and permanently mappedmemory 400 are located on different memory chips, the cost may be moresince the time required to copy the data may be longer.

The method 500 then compares 508 the cost of the memory mapping datatransfer technique to the cost of the memory copy data transfertechnique. If the cost of the memory mapping data transfer technique islarger, the method 500 may use 510, if possible, the memory copy datatransfer technique to transfer data associated with the I/O requestto/from the cache 216 to a host adapter 208 and/or device adapter 210.If, on the other hand, the cost of the memory copy data transfertechnique is larger, the method 500 may use 512, if possible, the memorymapping data transfer technique to transfer data associated with the I/Orequest to/from the cache 216 to a host adapter 208 and/or deviceadapter 210. As will be explained in more detail in association withFIG. 10, use of either the memory mapping or memory copy data transfertechnique may depend on whether “mapping” windows or “copy” windows areavailable to transfer the data. A more detailed embodiment of a methodfor performing steps 510 and 512 of FIG. 5 will be described inassociation with FIG. 10.

Referring to FIG. 6, in certain embodiments, a specified number of“mapping” windows 600 may be allocated for transferring data using thememory mapping data transfer technique, and a specified number of “copy”windows 602 may be allocated for transferring data using the memory copydata transfer technique. Each “mapping” window may provide a bus addresswindow 304 for transferring data using the memory mapping data transfertechnique, and each “copy” window may provide a bus address window 304for transferring data using the memory copy data transfer technique. Aswas previously mentioned, a bus address window 304 may provide a way fora host adapter 208 and/or device adapter 210 to read or write a certainamount of contiguous storage space (e.g., a track) on an address bus.

For example, assume that a total of two thousand windows are initiallyallocated for transferring data and, of these two thousand windows, onethousand are “mapping” windows and the other thousand are “copy”windows. The “mapping” windows may be used to service I/O requests forwhich the memory mapping data transfer technique is deemed moreefficient, and the “copy” windows may be used to service I/O requestsfor which the memory copy data transfer technique is deemed moreefficient. If a certain number of “copy” windows and “mapping” windowsare initially allocated for transferring data, systems and methods inaccordance with the invention may dynamically adjust the respectivenumber of windows that are allocated to each data transfer technique inaccordance with incoming I/O requests. For example, if not enough “copy”windows are available to service incoming I/O requests that areidentified to use the memory copy data transfer technique, more of thetotal windows may be allocated to “copy” windows 602 and less of thetotal windows may be allocated to “mapping” windows 600, as shown inFIG. 7. In this way, the number of “copy” windows and the number of“mapping” windows may be dynamically changed to correspond to incomingI/O requests.

Referring to FIG. 8, one embodiment of a method 800 for allocatingwindows and dynamically changing the allocation of windows isillustrated. As shown, the method 800 initially allocates 802 a firstnumber of “copy” windows to be used in association with the memory copydata transfer technique and a second number of “mapping” windows to beused in association with the memory mapping data transfer technique. Incertain embodiments, allocating the windows may include allocating acertain amount of memory 214 to implement the windows. For example, twogigabytes of memory 214 may be allocated to the windows, with onegigabyte allocated to the mappings 302 associated with the memorymapping data transfer technique, and one gigabyte allocated to thepermanently mapped memory 400 associated with the memory copy datatransfer technique.

In other embodiments, the allocation may include a total number ofwindows, with a certain proportion of the total windows being “mapping”windows and the remaining proportion of the total windows being “copy”windows. In certain embodiments, the total number of windows or thetotal amount of memory 214 allocated to windows is fixed. In otherembodiments, the total number of windows or the total amount of memory214 allocated to windows is adjusted as needed. The initial allocationof windows may be based on an estimate or guess of how many are neededor based on statistical data such as the type of I/O that has beenreceived in the past.

Once a first number of “copy” windows and a second number of “mapping”windows have been allocated, the method 800 processes 804 I/O requestsover a period of time using, if possible, the most efficient datatransfer technique to process the I/O requests. That is, if the memorymapping data transfer technique is deemed to be more efficient toprocess an I/O request, the method 800 ideally utilizes the memorymapping data transfer technique and an associated “mapping” window toprocess the I/O request. Similarly, if the memory copy data transfertechnique is deemed to be more efficient to process an I/O request, themethod 800 ideally utilizes the memory copy data transfer technique andan associated “copy” window to process the I/O request.

While processing the I/O requests, the method 800 tracks 806 the numberof times that the memory copy data transfer technique was ideallyutilized but was not available due to a lack of associated “copy”windows. Similarly, the method 800 tracks 808 the number of times thatthe memory mapping data transfer technique was ideally utilized but wasnot available due to a lack of associated “mapping” windows. Based onthe number of times each type of window was unavailable, the method 800dynamically changes 810 the allocation of “copy” windows and “mapping”windows (e.g., changes the number of “copy” windows relative to thenumber of “mapping” windows, or increases/decreases the number of “copy”windows and/or “mapping” windows). This may be performed with the goalof minimizing the number of times that windows of a certain type areneeded but unavailable.

Referring to FIG. 9, another embodiment of a method 900 for allocatingwindows and dynamically changing the allocation of windows isillustrated. As shown, the method 900 initially allocates 902 a firstnumber of “copy” windows to be used in association with the memory copydata transfer technique and a second number of “mapping” windows to beused in association with the memory mapping data transfer technique.Once a first number of “copy” windows and a second number of “mapping”windows are allocated, the method 900 processes 904 I/O requests over aperiod of time using, if possible, the most efficient data transfertechnique to process the I/O requests.

While the I/O requests are being processed, the method 900 tracks 906the proportion of I/O requests that are of certain types. For example,the method 900 may track 906 what proportion of the I/O requests aresequential I/O requests, large random I/O requests, and small random I/Orequests. Sequential I/O requests and large random I/O requests aretypically full track accesses and thus may be processed more efficientlyusing the memory mapping data transfer technique. Small random I/Orequests, by contrast, may include less-than-full-track accesses andthus may be processed more efficiently using the memory copy datatransfer technique. As was previously explained, the memory copy datatransfer technique may be used to copy less than a full track of datawhereas the memory mapping data transfer technique may need to map afull track of cache segments 300.

In accordance with the proportion of I/O requests that are of each type,the method 900 may dynamically adjust the number of “copy” windows andthe number of “mapping” windows to conform to the composition and typeof incoming I/O requests. This may assure, as much as possible, that themost efficient data transfer technique is selected and used for eachincoming I/O request.

FIG. 10 is a flow diagram showing one embodiment of a method 1000 fordetermining whether to utilize a memory mapping data transfer techniqueor a memory copy data transfer technique to process an I/O request. Incertain embodiments, this method 1000 is used in place of steps 510, 512illustrated in FIG. 5. As shown, the method 1000 initially determines1002, for a received I/O request, whether using the memory copy datatransfer technique is less costly than using the memory mapping datatransfer technique. If so, the method 1000 determines whether anavailable number of “copy” windows is below a threshold (e.g., 100), anavailable number of “mapping” windows is above a threshold (e.g., 100),and a cost difference between using the memory copy data transfertechnique and using the memory mapping data transfer technique is belowa threshold (e.g., 5 microseconds). If these conditions are satisfied,the method 1000 uses 1004 the memory mapping data transfer technique totransfer data associated with the I/O request. In essence, this step1004 uses the memory mapping data transfer technique to transfer dataassociated with the I/O request if “copy” windows are in short supply,“mapping” windows are not in short supply, and the cost differencebetween the data transfer techniques is not too large. Otherwise, themethod 1000 proceeds to the next step 1006.

At step 1006, if no “copy” windows are available but at least one“mapping” window is available, the method 1000 uses 1006 the memorymapping data transfer technique to transfer data associated with the I/Orequest regardless of the cost difference between using the memory copydata transfer technique and using the memory mapping data transfertechnique. In essence, this step 1006 uses the memory mapping datatransfer technique to transfer data associated with the I/O request ifit is the only option available, even if using the memory copy datatransfer technique would be the most efficient. Otherwise, the method1000 proceeds to the next step 1008.

At step 1008, if no “copy” windows and no “mapping” windows areavailable, the method 1000 waits 1008 for the next available window(“copy” window or “mapping” window) and uses this window along with thecorresponding data transfer technique to transfer the data associatedwith the I/O request. This is performed regardless of the costdifference between using the memory copy data transfer technique andusing the memory mapping data transfer technique. Otherwise, the method1000 proceeds to the next step 1010. At step 1010, the method 1000 usesthe memory copy data transfer technique to transfer data associated withthe I/O request since “copy” windows are available and using the memorycopy data transfer technique is less costly than using the memorymapping data transfer technique.

If, at step 1002, the memory copy data transfer technique is not lesscostly than the memory mapping data transfer technique (meaning that thememory mapping data transfer technique is less costly than the memorycopy data transfer technique), the method 1000 proceeds to step 1012. Atstep 1012, the method 1000 determines 1012 whether an available numberof “mapping” windows is below a threshold (e.g., 100), an availablenumber of “copy” windows is above a threshold (e.g., 100), and a costdifference between using the memory mapping data transfer technique andusing the memory copy data transfer technique is below a threshold(e.g., 5 microseconds). If these conditions are satisfied, the method1000 uses 1012 the memory copy data transfer technique to transfer dataassociated with the I/O request. In essence, this step 1012 uses thememory copy data transfer technique to transfer data associated with theI/O request if “mapping” windows are in short supply, “copy” windows arenot in short supply, and the cost difference between the data transfertechniques is not too large. Otherwise, the method 1000 proceeds to thenext step 1014.

At step 1014, if no “mapping” windows are available but at least one“copy” window is available, the method 1000 uses 1014 the memory copydata transfer technique to transfer data associated with the I/O requestregardless of the cost difference between using the memory mapping datatransfer technique and using the memory copy data transfer technique. Inessence, this step 1014 uses the memory copy data transfer technique totransfer data associated with the I/O request if it is the only optionavailable, even if using the memory mapping data transfer techniquewould be more efficient. Otherwise, the method 1000 proceeds to the nextstep 1016.

At step 1016, if no “mapping” windows or “copy” windows are available,the method 1000 waits 1016 for the next available window (“copy” windowor “mapping” window) and uses this window along with the correspondingdata transfer technique to transfer the data. This is performedregardless of the cost difference between the memory mapping datatransfer technique and the memory copy data transfer technique.Otherwise, the method 1000 proceeds to the next step 1018. At step 1018,the method 1000 uses 1018 the memory mapping data transfer technique totransfer data associated with the I/O request since “mapping” windowsare available and using the memory mapping data transfer technique isless costly than using the memory copy data transfer technique.

The flowcharts and/or block diagrams in the Figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods, and computer-usable media according to variousembodiments of the present invention. In this regard, each block in theflowcharts or block diagrams may represent a module, segment, or portionof code, which comprises one or more executable instructions forimplementing the specified logical function(s). It should also be notedthat, in some alternative implementations, the functions noted in theblock may occur out of the order noted in the Figures. For example, twoblocks shown in succession may, in fact, be executed substantiallyconcurrently, or the blocks may sometimes be executed in the reverseorder, depending upon the functionality involved. It will also be notedthat each block of the block diagrams and/or flowchart illustrations,and combinations of blocks in the block diagrams and/or flowchartillustrations, may be implemented by special purpose hardware-basedsystems that perform the specified functions or acts, or combinations ofspecial purpose hardware and computer instructions.

1. A method for dynamically optimizing utilization of data transfertechniques, the method comprising: processing each of a plurality of I/Orequests using one of several data transfer techniques depending onwhich data transfer technique is more efficient, the data transfertechniques comprising: a memory copy data transfer technique that copiescache segments associated with an I/O request from a cache memory to apermanently mapped memory, wherein the permanently mapped memory ispermanently mapped to a bus address window; and a memory mapping datatransfer technique that temporarily maps cache segments associated withan I/O request from the cache memory to the bus address window; in orderto process the I/O requests, utilizing a first number of “copy” windowsassociated with the memory copy data transfer technique, and a secondnumber of “mapping” windows associated with the memory mapping datatransfer technique; and dynamically adjusting at least one of the firstnumber and the second number to optimize the processing of the I/Orequests.
 2. The method of claim 1, wherein the bus address window is aPeripheral Component Interconnect (PCI) bus address window.
 3. Themethod of claim 1, further comprising monitoring, over a period of time,at least one of a number of times a “copy” window was needed butunavailable, and a number of times a “mapping” window was needed butunavailable.
 4. The method of claim 3, wherein dynamically adjustingcomprises dynamically adjusting to reduce the number of times a “copy”window was needed but unavailable.
 5. The method of claim 3, whereindynamically adjusting comprises dynamically adjusting to reduce thenumber of times a “mapping” window was needed but unavailable.
 6. Themethod of claim 1, further comprising monitoring, over a period of time,a proportion of the I/O requests that are more efficient using thememory copy data transfer technique, relative to the I/O requests thatare more efficient using the memory mapping data transfer technique. 7.The method of claim 6, wherein dynamically adjusting comprisesdynamically adjusting at least one of the first number and the secondnumber to correspond to the proportion.
 8. A computer program productfor dynamically optimizing utilization of data transfer techniques, themethod comprising, the computer program product comprising acomputer-readable medium having computer-usable program code embodiedtherein, the computer-usable program code configured to perform thefollowing when executed by at least one processor: process each of aplurality of I/O requests using one of several data transfer techniquesdepending on which data transfer technique is more efficient, the datatransfer techniques comprising: a memory copy data transfer techniquethat copies cache segments associated with an I/O request from a cachememory to a permanently mapped memory, wherein the permanently mappedmemory is permanently mapped to a bus address window; and a memorymapping data transfer technique that temporarily maps cache segmentsassociated with an I/O request from the cache memory to the bus addresswindow; in order to process the I/O requests, utilize a first number of“copy” windows associated with the memory copy data transfer technique,and a second number of “mapping” windows associated with the memorymapping data transfer technique; and dynamically adjust at least one ofthe first number and the second number to optimize the processing of theI/O requests.
 9. The computer program product of claim 8, wherein thebus address window is a Peripheral Component Interconnect (PCI) busaddress window.
 10. The computer program product of claim 8, wherein thecomputer-usable program code is further configured to monitor, over aperiod of time, at least one of a number of times a “copy” window wasneeded but unavailable, and a number of times a “mapping” window wasneeded but unavailable.
 11. The computer program product of claim 10,wherein dynamically adjusting comprises dynamically adjusting to reducethe number of times a “copy” window was needed but unavailable.
 12. Thecomputer program product of claim 10, wherein dynamically adjustingcomprises dynamically adjusting to reduce the number of times a“mapping” window was needed but unavailable.
 13. The computer programproduct of claim 8, wherein the computer-usable program code is furtherconfigured to monitor, over a period of time, a proportion of the I/Orequests that are more efficient using the memory copy data transfertechnique, relative to the I/O requests that are more efficient usingthe memory mapping data transfer technique.
 14. The computer programproduct of claim 13, wherein dynamically adjusting comprises dynamicallyadjusting at least one of the first number and the second number tocorrespond to the proportion.
 15. A system for dynamically optimizingutilization of data transfer techniques, the system comprising: at leastone processor; at least one memory device coupled to the at least oneprocessor and storing instructions for execution on the at least oneprocessor, the instructions causing the at least one processor to:process each of a plurality of I/O requests using one of several datatransfer techniques depending on which data transfer technique is moreefficient, the data transfer techniques comprising: a memory copy datatransfer technique that copies cache segments associated with an I/Orequest from a cache memory to a permanently mapped memory, wherein thepermanently mapped memory is permanently mapped to a bus address window;and a memory mapping data transfer technique that temporarily maps cachesegments associated with an I/O request from the cache memory to the busaddress window; in order to process the I/O requests, utilize a firstnumber of “copy” windows associated with the memory copy data transfertechnique, and a second number of “mapping” windows associated with thememory mapping data transfer technique; and dynamically adjust at leastone of the first number and the second number to optimize the processingof the I/O requests.
 16. The system of claim 15, wherein the bus addresswindow is a Peripheral Component Interconnect (PCI) bus address window.17. The system of claim 15, wherein the instructions further cause theat least one processor to monitor, over a period of time, at least oneof a number of times a “copy” window was needed but unavailable, and anumber of times a “mapping” window was needed but unavailable.
 18. Thesystem of claim 17, wherein dynamically adjusting comprises dynamicallyadjusting to at least one of reduce the number of times a “copy” windowwas needed but unavailable, and reduce the number of times a “mapping”window was needed but unavailable.
 19. The system of claim 15, whereinthe instructions further cause the at least one processor to monitor,over a period of time, a proportion of the I/O requests that are moreefficient using the memory copy data transfer technique, relative to theI/O requests that are more efficient using the memory mapping datatransfer technique.
 20. The system of claim 19, wherein dynamicallyadjusting comprises dynamically adjusting at least one of the firstnumber and the second number to correspond to the proportion.